A Better Lower Bound on the Competitive Ratio of the Randomized 2-Server Problem
نویسندگان
چکیده
We present a lower bound of 1+e ?1=2 1:6065 on the competitive ratio of randomized algorithms for the weighted 2-cache problem, which is a special case of the 2-server problem. This improves the previously best known lower bound of e=(e ? 1) 1:582 for both problems.
منابع مشابه
Randomized Competitive Analysis for Two-Server Problems
We prove that there exits a randomized online algorithm for the 2-server 3-point problem whose expected competitive ratio is at most 1.5949. This is the first nontrivial upper bound for randomized k-server algorithms in a general metric space whose competitive ratio is well below the corresponding deterministic lower bound (= 2 in the 2-server case).
متن کاملThe Weighted 2-Server Problem
We consider a generalization of the 2-server problem in which servers have diierent costs. We prove that, in uniform spaces, a version of the Work Function Algorithm is 5-competitive, and that no better ratio is possible. We also give a 5-competitive randomized, memoryless algorithm for uniform spaces, and a matching lower bound. For arbitrary metric spaces, in contrast with the non-weighted ca...
متن کاملA Randomized Algorithm for Two Servers on the Line (Extended Abstract)
In the k-server problem we wish to minimize, in an online fashion, the movement cost of k servers in response to a sequence of requests. For 2 servers, it is known that the optimal deterministic algorithm has competitive ratio 2, and it has been a long-standing open problem whether it is possible to improve this ratio using randomization. We give a positive answer to this problem when the under...
متن کاملCompetitive Algorithms for Generalized k-Server in Uniform Metrics
The generalized k-server problem is a far-reaching extension of the k-server problem with several applications. Here, each server si lies in its own metric space Mi. A request is a k-tuple r = (r1, r2, . . . , rk) and to serve it, we need to move some server si to the point ri ∈ Mi, and the goal is to minimize the total distance traveled by the servers. Despite much work, no f(k)-competitive al...
متن کاملCompetitive Algorithms for the Weighted Server Problem
Fiat, A. and M. Ricklin, Competitive algorithms for the weighted server problem, Theoretical Computer Science 130 (1994) 85-99. In this paper we deal with a generalization of the k-server problem (Manasse et al. 1988) in which the servers are unequal. In the weighted server mode1 each of the servers is assigned a positive weight. The cost associated with moving a server equals the product of th...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Inf. Process. Lett.
دوره 63 شماره
صفحات -
تاریخ انتشار 1997